Reachability Analysis of Linear Systems using Support Functions
نویسندگان
چکیده
This work is concerned with the algorithmic reachability analysis of continuoustime linear systems with constrained initial states and inputs. We propose an approach for computing an over-approximation of the set of states reachable on a bounded time-interval. The main contribution over previous works is that it allows us to consider systems whose sets of initial states and inputs are given by arbitrary compact convex sets represented by their support functions. We actually compute two over-approximations of the reachable set. The first one is given by the union of convex sets with computable support functions. As the representation of convex sets by their support function is not suitable for some tasks, we derive from this first over-approximation a second one given by the union of polyhedrons. The overall computational complexity of our approach is comparable to the complexity of the most competitive available specialized algorithms for reachability analysis of linear systems using zonotopes or ellipsoids. The effectiveness of our approach is demonstrated on several examples.
منابع مشابه
Efficient Reachability Analysis for Linear Systems Using Support Functions
This work is concerned with the algorithmic reachability analysis of linear systems with constrained initial states and inputs. In this paper, we present a new approach for the computation of tight polyhedral over-approximations of the reachable sets of a linear system. The main contribution over our previous work is that it makes it possible to consider systems whose sets of initial states and...
متن کاملCalcul d'Atteignabilité des systèmes hybrides avec des fonctions de support. (Reachability Analysis of Hybrid Systems using Support Functions)
This paper deals with conservative reachability analysis of a class of hybrid systems with continuous dynamics described by linear differential inclusions, convex invariants and guards, and linear reset maps. We present an approach for computing over-approximations of the set of reachable states. It is based on the notion of support function and thus it allows us to consider invariants, guards ...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملSymbolic orthogonal projections: a new polyhedral representation for reachability analysis of hybrid systems
This thesis deals with reachability analysis of linear hybrid systems. Special importance is given to the treatment of the necessary geometrical operations. In the first part, we introduce a new representation class for convex polyhedra, the symbolic orthogonal projections (sops). A sop encodes a polyhedron as an orthogonal projection of a higher-dimensional polyhedron. This representation is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009